Automated Search for Heuristic Functions
نویسندگان
چکیده
We present a metaheuristic algorithm for creating heuristic functions for CSP, especially SAT, with as low human interaction as possible. We use the concept of genetic programming to evolve local search heuristic functions encoded as a list of RAM model-like computer instructions. However, we’ve extended the RAM model language to reflect the features of genetic programming and the random mixing of code instructions. We present possible implementation of genetic operations upon these population members.
منابع مشابه
A connectionist approach for learning search-control heuristics for automated deduction systems
Automated deduction has a long tradition in computer science and most of the symbolic AI systems perform some kind of logic-based deductive inference. The central problem in automated deduction is the explosive growth of search spaces with deduction length. Methods of guiding and controlling the search process are indispensable. I will present a connectionist approach for learning search-contro...
متن کاملConditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space
Planning under partial observability in nondeterministic domains is a very significant and challenging problem, which requires dealing with uncertainty together with and-or search. In this paper, we propose a new algorithm for tackling this problem, able to generate conditional plans that are guaranteed to achieve the goal despite of the uncertainty in the initial condition and the uncertain ef...
متن کاملLearning Linear Ranking Functions for Beam Search with Application to Planning
Beam search is commonly used to help maintain tractability in large search spaces at the expense of completeness and optimality. Here we study supervised learning of linear ranking functions for controlling beam search. The goal is to learn ranking functions that allow for beam search to perform nearly as well as unconstrained search, and hence gain computational efficiency without seriously sa...
متن کاملAutomated Service Composition Using Heuristic Search
Automated service composition is an important approach to automatically aggregate existing functionality. While different planning algorithms are applied in this area, heuristic search is currently not used. Lacking features like the creation of compositions with parallel or alternative control flow are preventing its application. The prospect of using heuristic search for composition with qual...
متن کاملA Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
متن کامل